Characterizations of the Lagrange-Karush-Kuhn-Tucker Property
نویسنده
چکیده
In this note, we revisit the classical first order necessary condition in mathematical programming in infinite dimension. The constraint set being defined by C = g−1(K) where g is a smooth map between Banach spaces, and K a closed convex cone, we show that existence of Lagrange-Karush-Kuhn-Tucker multipliers is equivalent to metric subregularity of the multifunction defining the constraint, and is also equivalent to a generalized Abadie’s qualification condition. These results extend widely previous ones like [10, 11, 12, 16] by removing convexity type assumptions on the data. Key-words: Lagrange and Karush-Kuhn-Tucker multipliers, metric subregularrity, error bounds, Abadie’s qualification condition.
منابع مشابه
A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
We prove a new local upper Lipschitz stability result and the associated local error bound for solutions of parametric Karush–Kuhn–Tucker systems corresponding to variational problems with Lipschitzian base mappings and constraints possessing Lipschitzian derivatives, and without any constraint qualifications. This property is equivalent to the appropriately extended to this nonsmooth setting n...
متن کاملQuasiconvex Duality Theorems with Quasiconjugates and Generator
This paper is based on the author’s thesis, “On duality theorems for quasiconvex programming”. In this paper, we investigate duality theorems for quasiconvex programming as generalizations of results in convex programming, and consists of three topics. The first topic is about quasiconjugates and polar sets. The second is about three types of set containment characterizations. The third is abou...
متن کاملOn Set Containment Characterization and Constraint Qualification for Quasiconvex Programming
Dual characterizations of the containment of a convex set with quasiconvex inequality constraints are investigated. A new Lagrange-type duality and a new closed cone constraint qualification are described, and it is shown that this constraint qualification is the weakest constraint qualification for the duality.
متن کاملNew regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
We give new regularity conditions for convex optimization problems in separated locally convex spaces. We completely characterize the stable strong and strong Fenchel-Lagrange duality. Then we give similar statements for the case when a solution of the primal problem is assumed as known, obtaining complete characterizations for the so-called total and, respectively, stable total Fenchel-Lagrang...
متن کاملNew second-order optimality conditions in multiobjective optimization problems: Differentiable case
To get positive Lagrange multipliers associated with each of the objective function, Maeda [Constraint qualification in multiobjective optimization problems: Differentiable case, J. Optimization Theory Appl., 80, 483–500 (1994)], gave some special sets and derived some generalized regularity conditions for first-order Karush–Kuhn– Tucker (KKT)-type necessary conditions of multiobjective optimiz...
متن کامل